Signal separating device and signal separating method

ABSTRACT

Provided is a signal separating device capable of reducing the calculation amount and improving the communication quality. The signal separating device performs signal separation by the MLD method using the QR decomposition. The signal separating device includes: a nearest-neighbor signal point candidate detecting unit ( 120 ) which detects a nearest-neighbor signal point which is a signal point on a constellation used on the last stage and at the minimum distance from each of signal points obtained when fixing all the remaining combinations of the signal point candidates decided up to the last stage but one in the MLD; a signal point candidate selecting unit ( 130 ) which selects m (m is a natural number not greater than the modulation multi-value number of the reception signal) signal points (in each of the signal points, each target bit of the nearest-neighbor signal point is reversed) on the constellation corresponding to the respective nearest-neighbor signal points; and a distance calculation unit ( 140 ) which calculates an amount indicating an Euclid distance from each of the nearest-neighbor signal points and the selected signal points to the reception signal points after subjected to the unitary transform associated with the last stage.

TECHNICAL FIELD

The present invention relates to a signal demultiplexing apparatus andsignal demultiplexing method. More particularly, the present inventionrelates to a signal demultiplexing apparatus and signal demultiplexingmethod used in a radio receiving apparatus of the MIMO (Multi-InputMulti-Output) scheme.

BACKGROUND ART

Patent Document 1 discloses a receiver that carries out signaldemultiplexing according to a conventional QRM-MLD method (maximumlikelihood detection (MLD) method using QR decomposition and Malgorithm). As shown in FIG. 1, the receiver disclosed in PatentDocument 1 has: a plurality of receiving antennas 10-1, 10-2, 10-3 and10-4; channel estimation section 20; ranking section 30; rearrangingsection 40; QR decomposition section 50; signal converting section 60;maximum likelihood deciding section 70; and likelihood outputtingsection 80. Maximum likelihood deciding section 70 has four decidingsections 72-1, 72-2, 72-3 and 72-4. The number of deciding sections isdetermined according to the number of transmission signals. The decidingsections have similar processing blocks, and so fourth deciding section72-4 will be described as a representative of these deciding sections.The deciding section has symbol replica generating section 74-4, squareEuclidean distance calculating section 76-4 and surviving symbolcandidate selecting section 78-4. Here, assume that signals x=(x1 . . .x4)^(T) are each transmitted from four transmitting antennas by 16 QAMmodulation scheme where the superscript letter symbol T stands for thetranspose. Signals x are referred to as “transmission signal vectors”and form one symbol. x1, x2, x3 and x4 are referred to as “transmissionsignals” or “vector components.”

Channel estimation section 20 finds a channel impulse response value(CIR) or channel estimation value based on received signals includingthe pilot signal known both on the transmitting side and receiving side.Matrix H using channel estimation value hnm as a matrix element, isreferred to as a “channel matrix.” Note that hnm represents the channelestimation value between the m-th transmitting antenna and n-threceiving antenna.

Ranking section 30 rates or ranks a plurality of received signals y1 . .. y4 in order of the magnitude of power.

Rearranging section 40 reports the order a plurality of received signalsare arranged, to QR decomposition section 50 and signal convertingsection 60.

QR decomposition section 50 finds matrices Q and R such that channelmatrix H determined in channel estimation section 20 is represented as aproduct of unitary matrix Q and upper triangular matrix R (H=QR).Unitary matrix Q in this case satisfies Q^(H)Q=QQ^(H)=I, and may be asquare matrix or include different numbers of rows and columns. Thesuperscript letter H represents the conjugate transpose and I representsthe unit matrix.

Signal converting section 60 carries out signal conversion bymultiplying received signal vectors y=(y1, . . . , y4)^(T) by conjugatetranspose matrix Q^(H) of unitary matrix Q. y=Hx=QRx holds betweentransmission signals and received signals. When Q^(H) is multiplied uponthis equation from the left, Q^(H)y=z holds in the left side andQ^(H)QRx=Rx holds in the right side, so that the relationship betweentransmission signals and received signals can be represented by, forexample, z=Rx. However, z=(z1 . . . z4)^(T)=Q^(H)y holds. z is referredto as “received signal vectors after unitary conversion.”

Elements of received vector z can be represented asz1=r11x1+r12x2+r13x3+r14x4, z2=r22x2+r23x3+r24x4, z3=r33x3+r34x4 andz4=r44x4.

Maximum likelihood deciding section 70 narrows down candidates for atransmission signal (also referred to as “symbol candidates”), that is,decreases the number of candidates, by the maximum likelihood decidingmethod (MLD method). Symbol replica generating section 74-4 of decidingsection 72-4 generates candidates of a transmission signal associatedwith received signal y4, using the matrix elements of upper triangularmatrix R. The number of candidates is c, for example, and is setfixedly.

Square Euclidean distance calculating section 76-4 calculates squareEuclidean distances between converted received signal z4 and C signalpoint candidates. The square Euclidean distances represent the metricused as the base of likelihood calculation. Candidates of shorter squareEuclidean distances are decided to be closer to the transmitted symbol.

Surviving symbol candidate selecting section 78-4 outputs S1(≦C)candidates as surviving candidates based on the square Euclideandistances with respect to the candidates.

Likelihood outputting section 80 calculates the likelihoods orreliabilities of the candidates outputted from the surviving symbolcandidate selecting section in the final stage. To be more specific,these likelihoods are represented by log likelihood ratios (LLR's).Outputs from likelihood outputting section 80 represent signaldemultiplexing results and are transmitted to a subsequent demodulatingsection (for example, turbo decoder).

The operation will be described next. The receiver receives transmissionsignals as received signals y1 to y4 at four receiving antennas. Thesereceived signals are delivered to channel estimation section 20 andsignal converting section 60. The order a plurality of received signalsare arranged, is determined by channel estimation section 20, rankingsection 30 and rearranging section 40. Here, the received signals arealigned in order of the magnitude of received power and, for ease ofdescription, assume that received power increases in order from x1, x2,x3 and x4. Signal converting section 60 carries out unitary conversionof the received signals as in z=(z1 . . . z4)^(T)=Q^(H)y and inputs theconverted signals to maximum likelihood deciding section 70.

In the first stage in maximum likelihood deciding section 70, processingcorresponding to default setting is carried out in deciding section72-4. In this stage, the equation related to above z4 is focused upon.Matrix element r44 is known, and z4 does not interfere with othersignals and relies on only one transmission signal x4. In this way,there are sixteen patterns of signal point candidates of transmissionsignal x4 at maximum. Symbol candidate generating section 74-4 generatessixteen signal point candidates (C=16) of x4. In other words, sixteensignal points on the signal constellation are selected. The squareEuclidean distances between these candidates and converted fourthreceived signal z4 are calculated in square Euclidean distancecalculating section 76-4, and S1 candidates are selected as survivingcandidates in order from the shortest distance.

The second stage is performed in deciding section 72-3. Here, theequation related to z3 is focused upon. Matrix elements r33 and r34 areknown, and there are sixteen patterns of signal candidates of x4 andsixteen patterns of signal candidates of x3. Sixteen signal points areintroduced by symbol generating section 74-3 as additional signal pointsfor x3. Consequently, there may be 16×16=256 patterns of combinations ofsignal points (that is, 256 candidates). The 256 patterns of squareEuclidean distances between these candidates and third received signalx3 are calculated, and the candidates are narrowed down by selectingsixteen (S2=16) combinations in order from the smallest value.

Similar processing is carried out by deciding section 72-2 for the thirdstage. In this stage, the equation related to z2 is focused upon. Matrixelements r22, r23 and r24 are known and combinations of transmissionsignals x3 and x4 are narrowed down to sixteen patterns of candidates inthe previous stage, and there are sixteen patterns of signal pointcandidates of x2. Consequently, symbol candidate generating section 74-2generates sixteen candidates of x2. By selecting sixteen (S3=16)candidates of shorter square Euclidean distances from 256 patterns ofcombinations of signal points in this case, the candidates are narroweddown.

Similar processing is carried out by deciding section 72-1 for thefourth stage (here, the final stage). In this stage, the equationrelated to z1 is focused upon. Matrix elements r11, r12, r13 and r14 areknown and combinations of transmission signals x2, x3 and x4 arenarrowed down to sixteen patterns of candidates in the previous stage,and so there are sixteen signal point candidates of x1. Consequently,symbol candidate generating section 74-1 generates sixteen candidatesrelated to x1. By selecting sixteen patterns of candidates (S4=16) ofshorter square Euclidean distances from 256 patterns of combinations ofsignal points in this case, the candidates are narrowed down.

By limiting the number of candidates to equal to or less than a certainnumber (for example, S1≦C) in each stage in this way, signal pointcandidates of transmission signals can be narrowed down withoutcalculating the square Euclidean distances for all possible combinationsof signal points.

-   Patent Document 1: Japanese Patent Application Laid-Open No.    2006-157390

DISCLOSURE OF INVENTION

Problems to be Solved by the Invention

However, the amount of operation is great in the above conventionalsignal demultiplexing method, and further reduction in the amount ofoperation is desired. Even if symbol candidates are simply reduced,although the amount of operation is reduced, there is a possibility thatthere is no bit likelihood. In this case, precision of subsequentdemodulation decreases and there is a possibility that communicationquality deteriorates. Further, particularly if the number oftransmitting antennas is little and the M-ary modulation value is great,the amount of operation in the final stage becomes a problem. Forexample, in case of 2×2 MIMO, 64 QAM and QRM-MLD, if the number ofselected symbol candidates in stage 1 is N, the count of calculating thesquare Euclidean distances in stage 1 is 64 times and N×64 times instage 2.

In view of the above, it is therefore an object of the present inventionto provide a signal demultiplexing apparatus and signal demultiplexingmethod for reducing the amount of operation and improving communicationquality by lowering the probability that there is no bit likelihood.

Means for Solving the Problem

The signal demultiplexing apparatus according to the present inventionis used in a radio receiving apparatus adopting a multi-input andmulti-output scheme and that carries out signal demultiplexing by amaximum likelihood detection scheme using QR decomposition, employs aconfiguration including: a detecting section that detects, for everyremaining combination of signal point candidates determined by one stagebefore a final stage, a closest neighboring signal point that is on aconstellation used in the final stage and that is shortest separateddistance from signal points defined when the every combination is fixed;a selecting section that selects the signal points on the constellationwhich are associated with the closest neighboring signal point and anumber of which is a natural number equal to or less than an M-arymodulation value of a received signal; and a distance calculatingsection that calculates measures showing Euclidean distances between areceived signal point in the final stage after unitary conversion, andthe closest neighboring signal point and the selected signal points.

The signal demultiplexing method according to the present invention thatis used in a radio receiving apparatus adopting a multi-input andmulti-output scheme and that carries out signal demultiplexing by amaximum likelihood detection scheme using QR decomposition, includes:detecting, for every remaining combination of signal point candidatesdetermined by one stage before a final stage, a closest neighboringsignal point that is on a constellation used in the final stage and thatis shortest separated distance from signal points defined when the everycombination is fixed; selecting the signal points on the constellationwhich are associated with the closest neighboring signal point and anumber of which is a natural number equal to or less than an M-arymodulation value of a received signal; and calculating measures showingEuclidean distances between a received signal point in the final stageafter unitary conversion, and the closest neighboring signal point andthe selected signal points.

Advantageous Effect of the Invention

According to the present invention, it is possible to provide a signaldemultiplexing apparatus and signal demultiplexing method for enablingreduction in the amount of operation and improvement in communicationquality.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram showing a configuration of a receiver thatcarries out signal demultiplexing according to a conventional QRM-MLDmethod;

FIG. 2 is a block diagram showing a configuration of a maximumlikelihood deciding section according to Embodiment 1 of the presentinvention;

FIG. 3 shows a detailed configuration of a deciding section in the finalstage of FIG. 2;

FIG. 4 shows a detailed configuration where an M-ary modulation value 6,that is, 64 QAM modulation scheme, is adopted in the deciding section ofFIG. 3;

FIG. 5 illustrates an operation of the maximum likelihood decidingsection of FIG. 2;

FIG. 6 shows a configuration of a likelihood outputting section of FIG.2;

FIG. 7 illustrates the operation of the likelihood outputting section ofFIG. 2;

FIG. 8 shows a conventional configuration example to be compared withthe likelihood outputting section of FIG. 6;

FIG. 9 is a block diagram showing a configuration of the maximumlikelihood deciding section according to Embodiment 2;

FIG. 10 illustrates a ranking method;

FIG. 11 shows a detailed configuration where an M-ary modulation value6, that is, 64 QAM modulation scheme, is adopted in the deciding sectionof FIG. 9;

FIG. 12 illustrates an operation of the maximum likelihood decidingsection of FIG. 9;

FIG. 13 illustrates an operation of the maximum likelihood decidingsection of FIG. 9;

FIG. 14 is a block diagram showing a configuration of the maximumlikelihood deciding section according to Embodiment 3;

FIG. 15 illustrates “maximum separatable distance;”

FIG. 16 shows a detailed configuration where an M-ary modulation value6, that is, 64 QAM modulation scheme, is adopted in the deciding sectionof FIG. 14;

FIG. 17 illustrates the operation of the maximum likelihood decidingsection of FIG. 14; and

FIG. 18 illustrates a method of selecting signal points associated withthe closest neighboring signal point according to other embodiments.

BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, embodiments of the present invention will be described indetail with reference to the accompanying drawings. Further, in theembodiments, the same components will be assigned the same referencenumerals and overlapping description thereof will be omitted.

(Embodiment 1)

As shown in FIG. 2, maximum likelihood deciding section 100 according toEmbodiment 1 utilized in a signal demultiplexing apparatus mounted in aradio receiver has deciding section 110 that carries out processing inthe final stage and deciding section 160 that carries out processings inpreceding stages. Further, in the above signal demultiplexing apparatus,likelihood outputting section 150 that carries out likelihood selectionand LLR calculation is provided in the output stage of maximumlikelihood deciding section 100.

Further, deciding section 110 has neighboring signal point candidatedetecting section 120, signal point candidate selecting section 130 anddistance calculating section 140.

Similar to the maximum likelihood deciding section of the aboveconventional art, maximum likelihood deciding section 100 receives asinput from a signal converting section received signal vectors z afterunitary conversion and the matrix elements of upper triangular matrix R.

Deciding section 160 one stage before the final stage outputs (Npatterns) of combinations of candidate points of transmission signalsother than the transmission signal in which square Euclidean distancesare calculated with respect to candidate points in the final stage.

Deciding section 110 in the final stage detects the closest neighboringsignal point on the constellation to the signal point defined whensymbol candidates are fixed, for (N patterns) of combinations of symbolcandidates of transmission signals inputted from deciding section 160,and calculates square Euclidean distances between the received signal inthe final stage, and this closest neighboring signal point and m signalpoints associated in advance with this closest neighboring signal point,and outputs these square Euclidean distances to likelihood outputtingsection 150.

To be more specific, neighboring signal point candidate detectingsection 120 detects the closest neighboring signal point on theconstellation to “the signal point defined when symbol candidates arefixed,” for (N patterns) of combinations of symbol candidates oftransmission signals inputted from deciding section 160.

Signal point candidate selecting section 130 outputs m signal points onthe constellation associated with the closest neighboring signal pointdetected in neighboring signal point candidate detecting section 120, todistance calculating section 140. For example, signal point candidateselecting section 130 is formed with a memory that stores in advancesignal points on the constellation used in the final stage and m signalpoints associated with the signal points. Here, the m signal pointsassociated with the signal points on the constellation used in the finalstage are the signal points in which the signal points on theconstellation are inverted per bit and are the closest signal points.The number of candidate bits to be inverted equals the M-ary modulationvalue, and there may be a case where the same signal point is inverted aplurality of times, so that m is a natural number equal to or less thanthe M-ary modulation value of the transmission signal. Further, theremaybe case where a group of the closest neighboring signal point andsignal points associated with the closest neighboring signal point, isreferred to as a “signal point group” below.

Distance calculating section 140 calculates the square Euclideandistances between the received signal in the final stage after unitaryconversion, and the closest neighboring signal point detected inneighboring signal point candidate detecting section 120 and m signalpoints from signal point candidate selecting section 130, that is,constituent signal points of a signal point group.

Likelihood outputting section 150 selects the likelihood of thetransmission signal in the final stage, based on the square Euclideandistances calculated in distance calculating section 140. Each of Nsignal point groups includes signal points showing “1” or signal pointsshowing “0” for all bits of the transmission signal in the final stageas constituent signal points. Therefore, likelihood outputting section150 selects the signal point of the shortest square Euclidean distancein the constituent signal points in all signal point groups per bitvalue of each bit, and outputs this selected signal point and thelikelihood of this selected signal point. Further, likelihood outputtingsection 150 carries out processing of likelihoods of transmissionsignals in stages before the final stage based on the square Euclideandistances calculated in distance calculating section 140, in the samemanner as in the above selection in the final stage, and thereby selectsthe signal point of the shortest Euclidean distance in each class inwhich candidate signal points are classified per bit value of eachfocused bit, and outputs this selected signal point and the likelihoodof this selected signal point. Furthermore, for each bit, LLR of eachbit is calculated based on the likelihood of the bit value 0 and thelikelihood of the bit value 1. By so doing, likelihood outputtingsection 150 selects the likelihood of the signal point of the shortestsquare Euclidean distance in all candidate signal points per bit valueof each bit in each stage. The configuration and operation of likelihoodoutputting section 150 will be described later in detail.

FIG. 3 shows the detailed configuration of deciding section 110 in thefinal stage of FIG. 2. As shown in FIG. 3, deciding section 110 hasneighboring signal point candidate detecting sections 120-1 to N, signalpoint candidate selecting sections 130-1 to N and distance calculatingsections 140-1 to N in parallel, for function sections for, for (Npatterns) of combinations of received signals after unitary conversionfrom the stage before the last stage, detecting the closest neighboringsignal point, outputting signal points associated with the closestneighboring signal point and calculating square Euclidean distancesbetween the constituent signal points of each signal point group and thereceived signal in the final stage after unitary conversion. Further,distance calculating section 140 has square Euclidean distancecalculating circuits 142-1 to m+1. Square Euclidean distance calculatingcircuits 142-1 to m calculate square Euclidean distances between thereceived signal point in the final stage and m signal points outputtedfrom signal point candidate selecting section 130 and associated withthe closest neighboring signal point. Square Euclidean distancecalculating circuit 142-m+1 calculates the square Euclidean distancebetween the closest neighboring signal point detected in neighboringsignal point candidate detecting section 120 and the received signalpoint in the final stage.

FIG. 4 shows a detailed configuration of deciding section 110particularly when an M-ary modulation value 6, that is, 64 QAMmodulation scheme, is adopted. As shown in FIG. 4, distance calculatingsection 140 has square Euclidean distance calculating circuits 142-1 to7.

Next, the operation of maximum likelihood deciding section 100,particularly, the operations of neighboring signal point candidatedetecting section 120, signal point candidate selecting section 130 anddistance calculating section 140 in deciding section 110 when 64 QAM isadopted as the modulation scheme, will be described with reference toFIG. 5. Further, for ease of description, a case will be described wherethe number of antennas on the transmitting side is four and the numberof antennas on the receiving side is four, that is, 4×4 MIMOcommunication is carried out.

Neighboring signal point candidate detecting section 120 receives asinput from deciding section 160 combinations of candidate points oftransmission signals up to the stage before the final stage.

Here, given that 4×4 MIMO is adopted, the relational equation used inthe final stage (i.e. fourth stage) is above z1=r11x1+r12x2+r13x3+r14x4.(N patterns) of combinations of candidate signal points of x2, x3 and x4are inputted to neighboring signal point candidate detecting section120, to the stage before the final stage.

Neighboring signal point candidate detecting section 120 detects theclosest neighboring signal point on the constellation to “the signalpoint defined when symbol candidates are fixed,” for (N patterns) ofcombinations of symbol candidates of transmission signals. The result ofinputting combinations of symbol candidates of transmission signals(that is, combinations of x2, x3 and x4) in r12x2+r13x3+r14x4, which ispart of the above equation, is the symbol ▪ on the constellation shownin FIG. 5, that is, “the signal point defined when symbol candidates arefixed.” The signal point at the closest distance to this “signal pointdefined when symbol candidates are fixed” is detected in neighboringsignal point candidate detecting section 120. This processing is carriedout on a per combination basis. In the uppermost constellation of FIG.5, “000000” is detected as the closest neighboring signal point.

Signal point candidate selecting section 130 stores in advance signalpoints on the constellation used in the final stage and m signal pointsassociated with the signal points. Then, signal point candidateselecting section 130 outputs m signal points associated with theclosest neighboring signal point detected per combination in neighboringsignal point candidate detecting section 120, to distance calculatingsection 140.

Here, m signal points associated with the signal points on theconstellation used in the final stage are signal points in which eachbit of the signal points on the constellation is inverted and are theclosest signal points. That is, when the closest neighboring signalpoint is “000000,” “100010,” which is the signal point closest to theclosest neighboring signal point among signal points “1XXXXX” in whichthe first bit is inverted, is selected as a constituent signal point ofthe signal point group. Further, “010001,” which is the signal pointclosest to the closest neighboring signal point among signal points“X1XXXX” in which the second bit is inverted, is selected as aconstituent signal point of the signal point group. With 64 QAM, aconstituent signal point is selected for each of six bits. Further,given that the present embodiment is described here assuming the grayencoded constellation, the number of constituent signal points equal tothe number of bits is required in addition to the closest neighboringsignal point. However, the present invention is not limited to this, andthe constellation subjected to other encoding may be used. Depending onconstellations, there may be a case where, for example, the signal pointclosest to the closest neighboring signal point among signal points inwhich each bit is inverted, is “111111.” In this case, “111111” is theonly constituent signal point of the signal point group. Consequently,signal point candidate selecting section 130 stores in advance thesignal points on the constellation used in the final stage and m signalpoints which are associated with the signal points and the number ofwhich is a natural number equal to or less than the M-ary modulationvalue of the transmission signal.

Distance calculating section 140 calculates square Euclidean distancesbetween received signal z1 in the final stage after unitary conversion,and the closest neighboring signal point detected in neighboring signalpoint candidate detecting section 120 and m signal points from signalpoint candidate selecting section 130, that is, constituent signals of asignal group.

Next, the configuration and operation of likelihood outputting section150 will be described with reference to FIG. 6 and FIG. 7.

As shown in FIG. 6, likelihood outputting section 150 has: selectingsection 152 that selects the likelihood of the transmission signal inthe final stage based on the square Euclidean distances calculated indistance calculating section 140; selecting section 154 that associatesthe likelihood defined when the candidate points for the transmissionsignal in the final stage are the closest neighboring signal points (Npoints), with the bit value of each bit of transmission signal candidatepoints determined in the stages before the final stage; and LLRcalculating section 170 that calculates LLR based on the bit likelihoodof each transmission signal.

Selecting section 152 further has switching sections 156-1 to N andselecting sections 158-1 to 6 (the number of which corresponds to theM-ary modulation value). Switching sections 156 are provided in number Nto equal the number of (N patterns) of combinations of symbol candidatesof transmission signals up to the stage before the final stage, that is,in number N equivalent to the number of candidate point groups, areprovided. Switching sections 156-1 to N receive as input the constituentsignal points of the respective candidate point groups, and outputs theconstituent signal points to selecting sections 158 associated with thebit focused upon when constituent signal points other than the closestsignal point are selected, and outputs the closest neighboring signalpoint to all selecting sections 158.

Selecting sections 158 are provided in number to equal the M-arymodulation value. The bit to focus upon is set in advance, and so eachselecting section 158 selects the input signal point of the shortestsquare Euclidean distance per bit value of the bit to focus upon, andoutputs the selected input signal point, signal candidate pointsassociated with the input signal point and determined by the final stageand the likelihoods of these input signal point and signal candidatepoints. Selecting section 158 has two selectors (SEL) associated witheach bit value.

Selecting section 154 has selecting sections 154-1 to (X−1) associatedwith the first stage to the stage before the final stage. Further,selecting sections 154-1 to (X−1) are associated with stages before thefinal stage, and carries out processing of the likelihoods oftransmission signals in stages before the final stage based on thesquare Euclidean distances calculated in distance calculating section140, in the same manner as the selection in the final stage in aboveselecting section 152, and thereby selects the signal point of theshortest Euclidean distance in each class in which candidate signalpoints are classified per bit value of each focused bit, and outputsthis selected signal point and the likelihood of this selected signalpoint.

Using outputs from selecting section 152 and selecting section 154, LLRcalculating section 170 calculates LLR of each focused bit for thetransmission signal of each stage based on the likelihood of the bitvalue 0 and the likelihood of the bit value 1 of each focused bit.

The operation of above selecting section 152 will be visually describedwith reference to FIG. 7.

N signal point groups, as shown in the left side of FIG. 7, are inputtedto switching sections 156. Referring to the upper left signal pointgroups in FIG. 7, classification is performed per bit value of the bit(bit of dx in FIG. 7) to focus upon. That is, the closest neighboringsignal point is classified as is per bit value of each focused bit . Therest of the constituent signal points are classified according to thebit focused upon when the constituent signal points are selected.

Switching sections 156 assign input constituent signal points toselecting sections 158 provided in association with focused bits,according to such classification.

The bits to focus upon are set in advance in selecting sections 158.That is, selecting sections 158 are prepared in association with thefocused bits in the right figure of FIG. 7 (bit of dx in FIG. 7). Eachselecting section 158 selects the input signal point of the shortestsquare Euclidean distance per bit value of the focused bit and outputsthe selected input signal point, signal candidate points associated withthis input signal point and determined before the final stage and thelikelihoods of the input signal point and signal candidate points. Thatis, for example, selecting section 158-1 is set in advance to focus uponthe first bit, and selects the input signal point of the shortest squareEuclidean distance from “000000,” to “010011” according to the bit value0 of the focused bit, and outputs the selected input signal point,signal candidate points associated with the selected input signal pointand determined before the final stage and the likelihoods of the inputsignal point and signal candidate points. Further, selecting section158-1 selects the input signal point of the shortest square Euclideandistance from “100010” to “110011” according to the bit value 1 of thefocused bit and outputs the selected input signal point, signalcandidate points associated with the selected input signal point anddetermined before the final stage and the likelihoods of the inputsignal point and signal candidate points. By the way, the constituentsignal points of a signal point group outputted from signal pointcandidate selecting section 130 and neighboring signal point candidatedetecting section 120 efficiently include signal points showing “1” orsignal points showing “0” for all bits of the transmission signal in thefinal stage. Consequently, even if likelihoods are narrowed down to onelikelihood per bit value of each bit in selecting section 152, there islittle influence upon the reliability of subsequent processings. On theother hand, the amount of subsequent processings can be reducedsignificantly as described above.

For reference, if 64 symbol candidates are provided in the final stagewithout narrowing down symbol candidates in the final stage as in theconventional QRM-MLD, to carry out the same processing as in the abovelikelihood outputting section, selecting section 152 and selectingsection 154 would employ the configuration shown in FIG. 8. Thisconfiguration requires (24N−12)×X+361×N selectors. Compared to theconfiguration of likelihood outputting section 150 of the presentembodiment, 361×N selectors are additionally required. Consequently, byemploying the above configuration of maximum likelihood deciding section100, the configuration and control can be simplified.

Although the outputs from stages before the final stage have not beenparticularly described above, the present invention is not particularlylimited to this aspect, and QR-MLD, QRM-MLD or quadrant detectionQRM-MLD may be employed.

According to Embodiment 1, the signal demultiplexing apparatus that isused in a radio receiving apparatus adopting a MIMO scheme and thatcarries out signal demultiplexing by a maximum likelihood detectionscheme using QR decomposition, has: neighboring signal point detectingsection 120 as a detecting means that detects, for every remainingcombination of signal point candidates determined by one stage before afinal stage, a closest neighboring signal point that is on aconstellation used in the final stage and that is shortest separateddistance from signal points defined when every combination is fixed(i.e. signal points defined when symbol candidates are fixed); signalpoint candidate selecting section 130 as a selecting means that selectsthe signal points on the constellation which are associated with theclosest neighboring signal point and a number of which is a naturalnumber equal to or less than an M-ary modulation value of a receivedsignal; and distance calculating section 140 as a distance calculatingmeans that calculates measures showing Euclidean distances (squareEuclidean distances) between a received signal point in the final stageafter unitary conversion, and the closest neighboring signal point andthe selected signal points.

By so doing, the number of candidate points for every remainingcombination of signal point candidates determined by the stage beforethe final stage can be decreased to m+1, so that it is possible todecrease the amount of operation and reduce power consumption.

Each signal point on the constellation associated with the closestneighboring signal point (that is, each signal point group outputtedfrom signal point candidate selecting section 130 according to theclosest neighboring signal point) is a signal point in which a bit valueis inverted per focused bit to focus upon among bits of the closestneighboring signal point and closest to the closest neighboring signalpoint.

By so doing, the closest neighboring signal point in each combinationand m signal points associated with the closest neighboring signal pointinclude signal points showing “1” or signal point showing “0” for allbits of the transmission signal in the final stage as constituentsignals, so that it is possible to lower the probability that there isno bit likelihood, and improve communication quality in a communicationapparatus in which this signal demultiplexing apparatus is mounted.

Further, the signal demultiplexing apparatus has likelihood outputtingsection 150 as another selecting means that selects a signal point of ashortest Euclidean distance in each class in which the closestneighboring signal point in every combination and signal pointsassociated with the closest neighboring signal point are classified perbit value of each focused bit.

By so doing, it is possible to lower the probability that there is nobit likelihood in the outputs from the signal demultiplexing apparatus,and keep the reliability of subsequent processings and reduce the amountof operation.

Further, a signal demultiplexing apparatus that is used in a radioreceiving apparatus adopting a MIMO scheme having N transmittingantennas and M receiving antennas (with the present embodiment, N and Mare four) and that carries out signal demultiplexing by a maximumlikelihood detection scheme using QR decomposition, has: decidingsection 160 that, in a triangular matrix obtained by QR decomposing achannel estimation matrix, outputs every combination equal to or lessthan a maximum number of combinations adopted by transmission signalcandidates multiplied by matrix elements which do not include zero andwhich are included in a row including a matrix element including zero(with the present embodiment, a row other than the row in the finalstage); neighboring signal point detecting section 120 that detects, forevery combination, a closest neighboring signal point that minimizes aseparated distance on a constellation between: a total sum of a productof: a matrix element included in a row in which the matrix elementincluding zero is not included in the triangular matrix; and thetransmission signal candidate; and a matrix element of a received signalvector after unitary conversion obtained after a conjugate transposematrix of a unitary matrix is multiplied upon the received signalvector, the matrix element matching the total sum; distance calculatingsection 140 (to be more specific, square Euclidean distance calculatingcircuit 142-7) that calculates for every combination per bit value ofeach bit of transmission signal candidates other than the transmissionsignal candidate multiplied with the matrix element which does notinclude zero, a sum of: measures showing Euclidean distances between: atotal sum of products of matrix elements which do not include zero andthe transmission signal candidates; and the received signal afterunitary conversion matching the total sum; and measures showingEuclidean distances between the closest neighboring signal point and thereceived signal after the unitary conversion associated with the closestneighboring signal point; and likelihood outputting section 150 (to bemore specific, selecting section 152) that selects a signal point of asmallest sum calculated in distance calculating section 140 in eachclass in which the closest neighboring signal point in every combinationis classified per bit value of each bit of transmission signalcandidates multiplied with the matrix element which does not includezero.

Further, the signal demultiplexing apparatus has signal point selectingsection 130 that, in the triangular matrix obtained by QR decomposingthe channel estimation matrix, selects signal points on theconstellation which are associated with the closest neighboring signalpoint and a number of which is a natural number equal to or less than anM-ary modulation number of a transmission signal, per bit value of eachbit of transmission signal candidates multiplied with the matrix elementwhich does not comprise zero, and distance calculating section 140calculates for every combination a sum of: measures showing Euclideandistances between a total sum of the matrix element which does notinclude zero and the transmission signal candidate and a received signalafter unitary conversion matching the total sum; and measures showingEuclidean distances between the closest neighboring signal point and theselected signal points and the received signal after the unitaryconversion associated with the closest neighboring signal point and theselected signal points and the received signal; and likelihoodoutputting section 150 selects a signal point of the smallest sumcalculated in distance calculating section 140 in each class in whichthe closest neighboring signal point in every combination and signalpoints associated with the closest signal point are classified per bitvalue of each bit.

(Embodiment 2)

Embodiment 2 is limited to QRM-MLD, which is MLD involving QRdecomposition and which further uses M algorithm. In this case, sums ofsquare Euclidean distances e_(SUM1˜X-1) up to the stage before the finalstage are in order from the smallest sum, e_(SUM1˜X-1(1st rank)),e_(SUM1˜X-1(2nd rank)), e_(SUM1˜X-1(3rd rank)), . . . , ande_(SUM1˜X-1(N-th rank)). The square Euclidean distances inputted fromthe deciding section one stage before the final stage are inputted, inthe above order, to the deciding section in the final stage.

With the present embodiment, the amount of square Euclidean distancecalculation in the final stage is reduced based on the following theory.For ease of description, an example of the M-ary modulation value, m=6,that is, 64 QAM, will be described.

Regarding the sums of the square Euclidean distances up to the stagebefore the final stage, focusing upon the k-th rank and (k+1) -th ranknext to the k-th rank, the final sums e_(SUM1˜X) of square Euclideandistances are as follows.e _(SUM1X) =e _(SUM1X-1(k-th rank)) +e _(x)e′ _(SUM1X) =e _(SUM1X-1((k+1)-th rank)) +e′ _(X)

However, in case of 64 QAM, there are seven patterns of e_(x)'s ande′_(x)'s. Based on the pre-condition,e_(SUM1X-1(k-th rank))≦e_(SUM1X-1((k+1)-th rank)). Further, given thatsquare Euclidean distances assume values of zero or greater, ife_(SUM1X≦)e_(SUM1X-1((k+1)-th rank)) holds for each e_(X), thene_(SUM1X≦)e_(SUM1X) always holds.

In this case, the sum of square Euclidean distances in the final stage,which is based on the sums of the square Euclidean distances ranked(k+1)-th up to the stage before the final stage, needs not to beselected as likelihood candidates. Consequently, square Euclideandistance calculation is not necessary, so that it is possible to providean effect of reducing power consumption. However, calculation is notnecessary only for likelihood candidates in the final stage and, instages other than the final stage, at least the square Euclideandistance of the closest neighboring signal point needs to be calculatedto calculate likelihood candidates in a subsequent stage.

As shown in FIG. 9, maximum likelihood deciding section 200 utilized inthe signal demultiplexing apparatus mounted in a radio receiver hasdeciding section 210 that carries out processing in the final stage anddeciding section 260 that carries out processing in the precedingstages. Further, deciding section 210 has division/neighboring signalpoint candidate detecting section 220, signal point candidate selectingsection 230, distance calculating section 240 and likelihood selectioncontrolling section 270.

Deciding section 260 ranks combinations of symbol candidates oftransmission signals determined by a certain stage and the sum of squareEuclidean distances in the combinations, in order from the smallest sumof the square Euclidean distances, and outputs the result to decidingsection 210 (particularly, division/neighboring signal point candidatedetecting section 220 and likelihood selection controlling section 270).

Division/neighboring signal point candidate detecting section 220detects the closest neighboring signal point on the constellation to the“signal point defined when symbol candidates are fixed” and detects thedivision in which the “signal point defined when symbol candidates arefixed” is assigned placing the closest neighboring signal point in thecenter, for (N patterns) of combinations of symbol candidates oftransmission signals inputted from deciding section 260, and, accordingto a command signal from likelihood selection controlling section 270,outputs the closest neighboring signal point related to combinations ofsymbol candidates of transmission signals and the detected division,sequentially, to signal point candidate selecting section 230 anddistance calculating section 240, in order from the shortest squareEuclidean distance.

According to the command signal from likelihood select ion controllingsection 270, signal point candidate selecting section 230 sequentiallyoutputs signal points on the constellation associated with the closestneighboring signal point from division/neighboring signal pointcandidate detecting section 220 in order from the smallest squareEuclidean distance, to distance calculating section 240. For example,signal point candidate selecting section 230 stores in advance signalpoints on the constellation used in the final stage and m signal pointsassociated with the signal points. Further, signal point candidateselecting section 230 stores in advance the above m signal points rankedbased on distances between divisions partitioned placing in the centerthe signal points on the constellation used in the final stage and msignal points associated with the above signal points. Consequently,signal point candidate selecting section 230 is configured to output notonly all the outputs of m signal points in each combination, but alsothe outputs of only the signal points of specific ranks among m signalpoints in each combination, depending on the content of the commandsignal from likelihood selection controlling section 270. Further, theclosest neighboring signal point and signal points, regardless of all orpart of m signal points, from signal point candidate selecting section230 are referred to as a “signal point group” similar to Embodiment 1.

Here, the method of raking m signal points will be described using FIG.10. Inside the square frame of FIG. 10, the closest neighboring signalpoint is “000000.”The area (the above square frame) placing the closestneighboring signal point in the center is further divided, so that thedistances to m signal points can be ranked based on the divided areas.That is, if the divided area in which “the signal point defined whensymbol candidates are fixed” is located can be detected, the distancesto m signal points are uniquely determined and therefore can be ranked.

Distance calculating section 240 calculates square Euclidean distancesbetween the received signal in the final stage after unitary conversion,and the closest neighboring signal point from division/neighboringsignal point candidate detecting section 220 and signal points fromsignal point candidate selecting section 230, and outputs thecalculation result to likelihood selection controlling section 270.

Likelihood selection controlling section 270 compares: the final sum ofthe square Euclidean distances (e_(SUM1˜X) in the above description) ofa certain signal point group received from distance calculating section240 and held; and the sum of the square Euclidean distances(e_(SUM1˜X-1((k+1)-th rank)) in the above description) in eachcombination up to the previous stage which is one rank lower (that is,one rank higher where sums of square Euclidean distances are alignedfrom the smallest order) than combinations of transmission signals up tothe previous stage of this certain signal group.

As a result of comparison, if e_(SUM1X) are equal to or less thane_(SUM1X-1((k+1)-th rank)), likelihood selection controlling section 270outputs the signal point group of e_(SUM1X) and the final squareEuclidean distances per constituent signal point of this signal pointgroup. On the other hand, if e_(SUM1˜X) are greater thane_(SUM1˜X-1((k+1)-th rank)), likelihood selection controlling section270 holds the final sum of the square Euclidean distances of the signalpoint group of e_(SUM1˜X-1((k+1)-th rank)), and outputs a command signalfor commanding signal point candidate selecting section 230 anddivision/neighboring signal point candidate detecting section 220 tooutput the signal point group in the combination of transmission signalsin which the sum of the square Euclidean distances up to the previousstage is ranked next. By the way, likelihood selection controllingsection 270 compares: the final sum of m+1 square Euclidean distances ofa certain signal group; and the sum of m+1 square Euclidean distances upto the previous stage in the combination which is one rank lower (thatis, one rank higher when the sums of the square Euclidean distances arealigned from the smallest order) than the combination of transmissionsignals up to the previous stage of the certain signal point, accordingto the ranking with respect to the distances from the detected divisionin signal point candidate selecting section 230. Therefore, the commandsignal for signal point candidate selecting section 230 may includecommands for outputting signal points matching the focused bit and thebit value of the focused bit of a constituent signal point in whiche_(SUM1˜X) have become greater than e_(SUM1˜X-1)(k+1)-th place)) as aresult of comparison. Further, likelihood selection controlling section270 outputs a command signal to signal point candidate selecting section230 and division/neighboring signal point candidate detecting section220 to, first, control the output of the signal group ranked first atthe timing at which combinations of symbol candidates of transmissionsignals and the sums of square Euclidean distances in the combinationsare inputted from the previous stage.

FIG. 11 shows the detailed configuration of deciding section 210particularly in the case where the M-ary modulation value 6, that is, 64QAM modulation, scheme is adopted. Function sections(division/neighboring signal point candidate detecting section 220,signal point candidate selecting section 230 and distance calculatingsection 240) , provided in deciding section 210, are provided in squareEuclidean distance calculation processing sections 280-1 to N associatedwith (N patterns) of combinations of symbol candidates of transmissionsignals up to the stage before the final stage. Distance calculatingsections 240 each has seven square Euclidean distance calculationcircuits 242.

First, likelihood selection controlling section 270 outputs a commandsignal to signal point candidate selecting section 230 anddivision/neighboring signal point candidate detecting section 220 ofsquare Euclidean distance processing section 280-1 to, first, controlthe output of the signal group ranked first at the timing at whichcombinations of symbol candidates of transmission signals and the sumsof the square Euclidean distances in the combinations are inputted fromthe previous stage. Further, the final square Euclidean distancesaccording to the command signal is inputted.

Then, likelihood selection controlling section 270 outputs the commandsignal to square Euclidean distance calculation processing section 280-2to control the output of the signal point group ranked second.Likelihood selection controlling section 270 thus outputs output commandsignals to subsequent square Euclidean distance calculation processingsection 280 until e_(SUM1˜X)≦e_(SUM1˜X-1((k+1)-th rank)) is satisfied.

Next, the operation of maximum likelihood deciding section 200 havingthe above configuration, particularly, the operation of likelihoodselection controlling section 270 of deciding section 210 in case where64 QAM is adopted as the modulation scheme, will be described withreference to FIG. 12.

In the upper part of FIG. 12, constituent signal points of a signalgroup in combinations of transmission signals (d₁d₂, . . . , andd_(x-1)) having the sums of square Euclidean distances ranked k-th up tothe stage before the final stage, are classified per focused bit, andsignal points other than the closest neighboring signal point arefurther ranked based on the separated distance from the detecteddivision (1) in FIG. 12). In FIG. 12, it is obvious that the squareEuclidean distance to the closest neighboring signal point is rankedfirst, and so the other constituent signal points other than the closestneighboring signal point are ranked. Likelihood selection controllingsection 270 acquires the final sums of square Euclidean distancese_(SUM1˜X) (7 patterns) of these constituent signal points of the signalpoint group.

Next, likelihood selection controlling section 270 compares these finalsums of square Euclidean distances e_(SUM1˜X) (7 patterns) and the sumsof square Euclidean distances e_(SUM1˜X-1((k+1)-th rank)) up to thestage before the final stage in combinations of transmission signals(d′₁d′₂ . . . d′_(X−1)) up to the previous stage in which the sum ofsquare Euclidean distances is ranked (k+1)-th ((2) in FIG. 12).

Then, as a result of comparison, if e_(SUM1˜X) are equal to or less thane_(SUM1˜X-1((k+1)-th rank)), the signal point group of e_(SUM1˜X) andthe final square Euclidean distances of the constituent signal points ofthis signal point group are inputted to likelihood outputting section150. On the other hand, if e_(SUM1˜X) are greater thane_(SUM1˜X-1((k+1)-th rank)), likelihood selection controlling section270 holds (updates) the final sum of the square Euclidean distances ofthe signal group of e_(SUM1˜X-1((k+1)-th rank)), and outputs a commandsignal for commanding signal point candidate selecting section 230 anddivision/neighboring signal point candidate detecting section 220 tooutput a signal point group in combinations of transmission signals upto the previous stage in which the sum of square Euclidean distances isranked next (see (3) in FIG. 12).

By the way, if e_(SUM1˜X) become greater thane_(SUM1˜X-1((k+1)-th rank)) of only constituent signal points (rankedfifth and sixth) of a signal point group surrounded by a square as shownin the upper part in FIG. 12, output command signals for constituentsignal points are outputted to signal point candidate selecting section230, according to the focused bits and the bit values of the focusedbits of the constituent signal points ranked fifth and sixth (in FIG.12, the focused bit is the second bit and its bit value is “1” in“010001” and the focused bit is the first bit and its bit value is “1”in “100010”).

That is, in (2) of FIG. 12, the sums of square Euclidean distancese_(SUM1˜X-1((k+1)rank)) of symbol candidates d′₁d′₂, . . . , andd′_(X−1) up to the previous stage and the sum of square Euclideandistances of ranked likelihood candidates, are compared. Then, in (3) ofFIG. 12, with respect to likelihood candidates wheree_(SUM1˜X-1((k+1)-th rank))<e_(SUM1˜X) holds, the likelihood candidatesand the sums of square Euclidean distances e′_(SUM1˜X) are updated. Forexample, in the comparison of (2) of FIG. 12, comparison is drawnsequentially from the first rank in the table in the upper part of FIG.12, and, if e_(SUM1˜X-1((k+1)-th rank))<e_(SUM1˜X) holds in the fifthrank or sixth rank, the sum of square Euclidean distances of likelihoodcandidates for the bit value 1 of the first and second bits of thesymbol candidates in the final stage is compared with e′_(SUM1˜X) oflikelihood candidates of the bit value 1 of the first and second bits,and the smaller sum is updated as new square Euclidean distances.Further, if the same processing is repeated the next time, comparisonneeds not to be drawn again sequentially from the first rank and onlythe fifth rank and sixth rank need to be compared. If updating does nottake place by the sixth rank,e_(SUM1˜X-1(k-th rank))≦e_(SUM1˜X-1((k+1)-th rank)) (k=1 to N−1) holds,and so updating does not take place thereafter. Consequently, after thesixth rank, square Euclidean distance calculation is not necessary.However, as described above, calculation is not necessary only forlikelihood candidates in the final stage, and at least the squareEuclidean distance of the closest neighboring signal point needs to becalculated to calculate likelihood candidates in stages other than thefinal stage.

The above description will be described in more detail with reference toFIG. 13. First, the sum of square Euclidean distances e_(SUM1˜X) (theclosest neighbor) of the closest neighboring signal point ranked k-thand e_(SUM1˜X) ranked first to sixth rank of m signal points associatedwith the closest neighboring signal point ranked k-th are compared withthe sum of square Euclidean distances of the closest neighboring signalpoint ranked (k+1)-th ((1) of FIG. 12). Second, when e_(SUM1˜X-1)((k+1)-th rank) is between the fourth rank and fifth rank in k ranks,the closest neighboring signal point ranked k-th and likelihoods offocused bits ranked first to fourth in the k ranks and the bit values ofthe focused bits, are determined ((2) in FIG. 12). Third, in what ranksthe bits and the bit values of the bits ranked fifth and sixth in kranks correspond to in the k+1 ranks, is learned. For example, assumethat the fifth rank in the k ranks corresponds to the fourth rank in the(k+1) ranks and the sixth rank in the k ranks corresponds to the secondrank in the (k+1) ranks ((3) in FIG. 12). Fourth, these are compared andthe smaller sum of square Euclidean distances is used as the likelihoodcandidates of the focused bits and bit values ((4) in FIG. 12).Likelihoods of these bits and bit values are unfixed. Fifth, the volumeof e_(SUM1˜X-1) ((k+2)-th rank) is compared with the second rank in thek+1 ranks and the fifth rank in the k ranks ((5) in FIG. 12). Sixth,when e_(SUM1˜X-1) ((k+2)-th rank) is greater than the fifth rank in thek ranks, the likelihoods of the bits and bit values corresponding to thesecond rank in the k+1 ranks and the fifth rank in the k ranks are fixedto the values of the sums of square Euclidean distances held ase_(SUM1˜X-1) ((k+2)-th rank). At this point, likelihoods are fixed forall bits and bit values ((6) in FIG. 12). Then, square Euclideandistance calculation is not necessary afterward (other than the closestneighboring signal point).

According to Embodiment 2, the signal demultiplexing apparatus that isused in a radio receiving apparatus adopting a MIMO scheme and thatcarries out signal demultiplexing by a maximum likelihood detectionscheme using QR decomposition, has: division/neighboring signal pointdetecting section 220 as a detecting means that detects, for everyremaining combination of signal point candidates determined by one stagebefore a final stage, a closest neighboring signal point that is on aconstellation used in the final stage and that is shortest separateddistance from signal points defined when every combination is fixed;signal point candidate selecting section 230 as a selecting means thatselects the signal points on the constellation which are associated withthe closest neighboring signal point and a number of which is a naturalnumber equal to or less than an M-ary modulation value of a receivedsignal; distance calculating section 240 as a distance calculating meansthat calculates measures showing Euclidean distances between a receivedsignal point in the final stage after unitary conversion, and theclosest neighboring signal point and the selected signal points; andlikelihood selection controlling section 270 as another selectingsection that: makes the detecting section and the selecting sectionsequentially output the closest neighboring signal point and the signalpoints associated with the closest neighboring signal point in orderfrom a smallest Euclidean distance between signal point candidates inevery combination and the received signal point in each stage afterunitary conversion; stops an output when a measure showing a finalEuclidean distance in a current combination is equal to or less thanmeasures which are one rank higher than the current combination andwhich show Euclidean distances up to the stage before the final stage;and selects the closest neighboring signal point in the currentcombination and signal points associated with the closest neighboringsignal point.

By so doing, when the measure showing the final square Euclideandistance in the current combination is equal to or less than themeasures showing the Euclidean distances up to the stage before thefinal stage which is one rank higher than the current combination, theoutputs from the detecting means and the selecting means can be stopped,so that it is possible to reduce the amount of operation of distancecalculating section 240 subsequent to the both means.

(Embodiment 3)

Embodiment 3 is directed to reducing the amount of calculation of squareEuclidean distances using the same theory as in Embodiment 2. However,with Embodiment 3, the signal point candidate selecting section storessignal points on the constellation used in the final stage and m signalpoints associated with the signal points, and further stores inassociation with the above m signal points the tentative distancesrepresenting the distances of the above m signal points to the closestneighboring signal point in distance unit by using the shortest distancebetween adjacent signal points on the above constellation as distanceunit 1. In “comparison” in the likelihood selection controlling section,a predetermined distance matching the tentative distance is used.

As shown in FIG. 14, maximum likelihood deciding section 300 ofEmbodiment 3 utilized in the signal demultiplexing apparatus mounted inthe radio receiver has deciding section 310 carrying out processing inthe final stage. This deciding section 310 has neighboring signal pointcandidate detecting section 320, signal point candidate selectingsection 330, distance calculating section 340 and likelihood selectioncontrolling section 370.

Deciding section 260 ranks combinations of symbol candidates oftransmission signals determined by an applicable stage and sums ofsquare Euclidean distances in the combinations in order from thesmallest sum of square Euclidean distances, and outputs the result todeciding section 310 (particularly, neighboring signal point candidatedetecting section 320 and likelihood selection controlling section 370).

Neighboring signal point candidate detecting section 320 detects theclosest neighboring signal point on the constellation to the “signalpoint defined when symbol candidates are fixed,” for (N patterns) ofcombinations of symbol candidates of transmission signals inputted fromdeciding section 260, and sequentially outputs the closest neighboringsignal point related to combinations of symbol candidates oftransmission signals, to signal point candidate selecting section 330and distance calculating section 340, according to the command signalfrom likelihood selection controlling section 370.

According to the command signal from likelihood select ion controllingsect ion 370, signal point candidate selecting section 330 outputssignal points on the constellation associated with the closestneighboring signal point from neighboring signal point candidatedetecting section 320 and “tentative distances” of the signal points,sequentially to distance calculating section 340 in order from theshortest square Euclidean distance up to the previous stage. Forexample, signal point candidate selecting section 330 stores in advancesignal points on the constellation used in the final stage and m signalpoints associated with the signal points, and further stores in advancethem signal points ranked based on the “tentative distances” between thesignal points on the constellation used in the final stage and the msignal points associated with the signal points. Consequently, signalpoint candidate selecting section 330 is configured to output not onlyall the outputs of m signal points in each combination but also theoutputs of only signal points of specific ranks among m signal points ineach combination according to the content of the command signal fromlikelihood selection controlling section 370. Further, a group of theclosest neighboring signal point and signal points, regardless of all orpart of m signal points, from signal point candidate selecting section330 are referred to as the “signal point group” similar to Embodiment 1.

Here, referring to FIG. 15, “m signal points and their tentativedistances” will be described. In FIG. 15, the “signal point defined whensymbol candidates are fixed” represented by the symbol ▪ is shown first,and its closest neighboring signal point is “000000.” Further, theclosest m signal points among signal points in which each bit of theclosest neighboring signal point is inverted, to be more specific,“100010,” “010001,” “001000,” “000100,” “000010” and “000001,” areassociated with “000000.” Furthermore, the distances (i.e. tentativedistances) from the m signal points to the closest neighboring signalpoint are associated by using the shortest distance (the solid line inFIG. 15) between adjacent signals on the constellation as distance unit1. That is, “001000,” “000100,” “000010” and “000001” are associatedwith tentative distance 1, and “100010” and “010001” are associated withtentative distance 2.

Distance calculating section 340 calculates square Euclidean distancesbetween the received signal in the final stage after unitary conversion,and the closest neighboring signal point from neighboring signal pointcandidate detecting section 320 and signal points from signal pointcandidate selecting section 330, and outputs the calculation result tolikelihood selection controlling section 370. Further, the tentativedistances associated with the m signal points are outputted with thecalculation result to likelihood selection controlling section 370.

Likelihood selection controlling section 370 compares the “maximumseparatable distances” that can be adopted between the constituentsignals and the “signal point defined when symbol candidates are fixed,”which is determined from tentative distances associated with constituentsignal points of a certain signal point group received from distancecalculating section 340 and held, with the sums of square Euclideandistances (e_(SUM1˜X-1((k+1)-th rank)) in the above description) up tothe stage before the final stage in combinations which are one ranklower (that is, one rank higher where the sums of square Euclideandistances are aligned from the smallest order) than combinations oftransmission signals up to the stage before the final stage of thecertain signal point group.

When the results of comparison, the “maximum separatable distances,” areequal to lower than e_(SUM1˜X-1((k+1)-th rank)), likelihood selectioncontrolling section 370 outputs constituent signal points resulting fromthe “maximum separatable distances” and final square Euclidean distancesof these constituent signal points, to likelihood outputting section150. On the other hand, when the “maximum separatable distances” aregreater than e_(SUM1˜X-1((k+1)-th rank)), likelihood selectioncontrolling section 370 holds the final sum of the square Euclideandistances of the signal point group of e_(SUM1˜X-1((k+1)-th rank)), andoutputs a command signal for commanding signal point candidate selectingsection 330 and neighboring signal point candidate detecting section 320to output a signal point group in the combination of transmissionsignals up to the stage before the final stage in which the sum ofsquare Euclidean distances is ranked next. By the way, likelihoodselection controlling section 370 compares: m+1 “maximum separatabledistances” of a certain signal point group; and the sum of m+1 squareEuclidean distances of the certain signal point group up to the previousstage in combinations which are one rank lower (that is, one rank higherwhere the sums of square Euclidean distances are aligned from thesmallest order) than combinations of transmission signals up to theprevious stage according to “tentative distances.” Therefore, thecommand signal for signal point candidate selecting section 330 mayinclude a command for outputting only signal points matching the focusedbit and bit value of the focused bit of a constituent signal point inwhich the “maximum separatable distance” becomes greater thane_(SUM1˜X-1((k+1)-th rank)) as a result of comparison. Further,likelihood selection controlling section 370 outputs a command signal tosignal point candidate selecting section 330 and neighboring signalpoint candidate detecting section 320 to, first, control the output ofthe signal point group ranked first at the timing at which combinationsof symbol candidates of transmission signals and the sums of squareEuclidean distances in the combinations are inputted from the previousstage.

Here, the above “maximum separatable distance” will be described withreference to FIG. 15. As shown in FIG. 15, when the closest neighboringsignal point is “000000,” the “maximum separatable distance” between aconstituent signal when the tentative distance from this closestneighboring signal point is 1 (for example, “0010000” in FIG. 15) andthe “signal point defined when symbol candidates are fixed” assume acase where the “signal point defined when symbol candidates are fixed”is at the position represented by “o” in FIG. 15 and is√(1.5²+0.5²)=√(2.5) when the distance between adjacent signal pointsis 1. By the way, in the same manner, when the tentative distance istwo, the “maximum separatable distance” is √(2.5²+0.5²)=√(6.5).

FIG. 16 shows the detailed configuration of deciding section 310,particularly in a case where the M-ary modulation value 6, that is, 64QAM modulation scheme, is adopted. Function sections (neighboring signalpoint candidate detecting section 320, signal point candidate selectingsection 330 and distance calculating section 340) provided in decidingsection 310 are provided in square Euclidean distance calculationprocessing sections 380-1 to N associated with (N patterns) ofcombinations of symbol candidates of transmission signals up to thestage before the final stage. Distance calculating sections 340 each hasseven square Euclidean distance calculation circuits 342.

First, likelihood selection controlling section 370 outputs a commandsignal to signal point candidate selecting section 330 and neighboringsignal point candidate detecting section 320 of square Euclideandistance processing section 380-1 to, first, control the output of thesignal group ranked first at the timing at which combinations of symbolcandidates of transmission signals and the sums of the Euclideandistances in the combinations are inputted from the previous stage.Further, the final square Euclidean distance is inputted according tothe command signal.

Then, likelihood selection controlling section 370 outputs the commandsignal to square Euclidean distance calculation processing section 380-2to control an output of a signal point group ranked second. Likelihoodselection controlling section 370 thus outputs output command signals tosubsequent square Euclidean distance calculation processing section 380until the “maximum separatable distance”≦e_(SUM1˜X-1(k+1 rank)) issatisfied.

Next, the operation of maximum likelihood deciding section 300 havingthe above configuration, particularly, the operation of likelihoodselection controlling section 370 of deciding section 310 in case where64 QAM is adopted as the modulation scheme, will be described withreference to FIG. 17.

In the upper part of FIG. 17, constituent signal points of a signalgroup in combinations of transmission signals (d₁d₂, . . . , andd_(X−1)) having the sum of square Euclidean distances ranked k-th up tothe stage before the final stage, are classified per focused bit, andsignal points other than the closest neighboring signal point areassociated with the tentative distances from the closest neighboringsignal point ((1′) in FIG. 17). Likelihood selection controlling section370 acquires the “Maximum separatable distances” (7 patterns) that canbe adopted between these constituent signal points of a signal pointgroup and “the signal point defined when symbol candidates are fixed.”

Next, likelihood selection controlling section 370 compares these“maximum separatable distances” (7 patterns) and the sums of squareEuclidean distances e_(SUM1˜X-1((k+1)-th rank)) up to the previous stagein combinations of transmission signals (d′₁d′₂, . . . , and d′_(X−1))having the sum of square Euclidean distances ranked k+1-th next ((2) inFIG. 17).

Then, if the “maximum separatable distances” are equal to or less thane_(SUM1˜X-1(k+1)-th rank)) as a result of comparison, constituent signalpoints resulting from the “maximum separatable distances” and finalsquare Euclidean distances of these constituent signal points, areoutputted to likelihood outputting section 150. On the other hand, ifthe “maximum separatable distances” are greater thane_(SUM1˜X-1((k+1)-th rank)), likelihood selection controlling section370 holds (updates) the final sum of the square Euclidean distances of asignal group of e_(SUM1˜X-1((k+1)-th rank)), and outputs a commandsignal for commanding signal point candidate selecting section 330 andneighboring signal point candidate detecting section 320 to output asignal point group in the combination of transmission signals in whichthe sum of square Euclidean distances up to the stage before the finalstage is ranked next.

According to Embodiment 3, the signal demultiplexing apparatus that isused in a radio receiving apparatus adopting a MIMO scheme and thatcarries out signal demultiplexing by a maximum likelihood detectionscheme using QR decomposition, has: neighboring signal point detectingsection 320 as a detecting means that detects, for every remainingcombination of signal point candidates determined by one stage before afinal stage, a closest neighboring signal point that is on aconstellation used in the final stage and that is shortest separateddistance from signal points defined when every combination is fixed;signal point candidate selecting section 330 as a selecting means thatselects the signal points on the constellation which are associated withthe closest neighboring signal point and a number of which is a naturalnumber equal to or less than an M-ary modulation value of a receivedsignal; distance calculating section 340 as a distance calculating meansthat calculates measures showing Euclidean distances between a receivedsignal point in the final stage after unitary conversion, and theclosest neighboring signal point and the selected signal points; andlikelihood selection controlling section 370 as another selectingsection that: makes the detecting section and the selecting sectionsequentially output the closest neighboring signal point and the signalpoints associated with the closest neighboring signal point in orderfrom a smallest Euclidean distance between signal point candidates inevery combination and the received signal point in each stage afterunitary conversion; stops an output when a measure showing a finalEuclidean distance in a current combination is equal to or less thanmeasures which are one rank higher than the current combination andwhich show Euclidean distances up to the stage before the final stage;and selects the closest neighboring signal point in the currentcombination and signal points associated with the closest neighboringsignal point.

By so doing, when the measure showing the final square Euclideandistance in the current combination is equal to or less than themeasures showing Euclidean distances up to the stage before the finalstage which are one rank higher than the current combination, theoutputs from the detecting means and the selecting means can be stopped,so that it is possible to reduce the amount of operation of distancecalculating section 340 subsequent to the both means.

(Other Embodiments)

With Embodiment 1, a memory that stores symbol candidates associatedwith the closest neighboring signal point has been described as anexample of signal point candidate selecting section 130. However,depending on the circuit configuration, it is also possible to findapplicable symbol candidates from the closest neighboring signal pointeach time. Note that the gray encoded constellation is a precondition.Further, although the coordinates of signal points on the constellationadopt ±r11, ±3r11, ±5r11 and ±7r11, particularly when 64 QAM modulationscheme is adopted, the present invention is not limited to this.Hereinafter, referring to FIG. 18, this will be described in detail.

First, the x coordinate of the closest neighboring signal point “000000”is compared with “0” and the signal point in which the first bit isinverted and which is required in likelihood calculation is detectedbased on the comparison result (with respect to the closest neighboringsignal point, the opposite signal point across the x coordinate “0,”that is, the signal point, “100010,” surrounded by the square in FIG.18, is detected). The second bit is compared with the y coordinate “0”and is processed likewise (with respect to the closest neighboringsignal point, the opposite signal point across the y coordinate “0,”that is, the signal point, “100010,” surrounded by the square in FIG.18, is detected).

Next, given that the result of comparison with the x coordinate “0” islearned, the closest neighboring signal point is then compared with thex coordinate 4r11 or −4r11, and the signal point in which the third bitis inverted and which is required in likelihood calculation, that is,“0010000” surrounded by the triangle in FIG. 18, is detected based onthe comparison result (if the x coordinate of the closest neighboringsignal point is greater than “0,” the opposite signal point across the xcoordinate 4r11 is detected. If smaller, the opposite signal pointacross the x coordinate −4r11 is detected.). With respect to the fourthbit, by carrying out the same processing in comparison with the ycoordinate, the point surrounded by the triangle in FIG. 18, that is,“000100,” is detected.

Given that the result of comparison with the x coordinate 4r11 or −4r11is learned, the closest neighboring signal point is then compared withthe x coordinate 2r11, 6r11, −2r11 and −6r11, and the signal point inwhich the fifth bit is inverted and which is required in likelihoodcalculation, that is, “000010” encircled in FIG. 18, is detected basedon the comparison result (if the x coordinate of the closest neighboringsignal point is greater than 4r11, the opposite signal point across 6r11is detected. If the x coordinate of the closest neighboring signal pointis greater than “0” and is smaller than 4r11, the opposite signal pointacross 2r11 is detected. If the x coordinate of the closest neighboringsignal point is greater than −4r11 and is smaller than “0,” the oppositesignal point across −2r11 is detected. If the x coordinate of theclosest neighboring signal point is smaller than −4r11, the oppositesignal point across −6r11 is detected.). With respect to the sixth bit,by carrying out the same processing in comparison with the y coordinate,the signal point encircled in FIG. 18, that is, “000001,” is detected.

Embodiments of the present invention have been described.

Each function block employed in the description of each of theaforementioned embodiments may typically be implemented as an LSIconstituted by an integrated circuit. These may be individual chips orpartially or totally contained on a single chip. “LSI” is adopted herebut this may also be referred to as “IC,” “system LSI,” “super LSI, ” or“ultra LSI” depending on differing extents of integration. Further, themethod of circuit integration is not limited to LSI's, andimplementation using dedicated circuitry or general purpose processorsis also possible. After LSI manufacture, utilization of a programmableFPGA (Field Programmable Gate Array) or a reconfigurable processor whereconnections and settings of circuit cells within an LSI can bereconfigured is also possible. Further, if the integrated circuittechnology comes out to replace LSI's as a result of the advancement ofsemiconductor technology or a derivative other technology, it isnaturally also possible to carry out function block integration usingthis technology. Application of biotechnology is also possible.

The disclosure of Japanese Patent Application No. 2006-225933, filed onAug. 22, 2006, including the specification, drawings and abstract, isincorporated herein by reference in its entirety.

Industrial Applicability

The signal demultiplexing apparatus and signal demultiplexing methodaccording to the present invention provides advantages of reducing theamount of operation and improving communication quality, and aresuitable for use particularly in a radio receiving apparatus thatcarries out MIMO communication.

1. A signal demultiplexing method for determining a likelihood of eachbit included in a first signal based on a maximum likelihood detection(MLD) method using QR decomposition, the first signal excluding a secondsignal to be calculated only in a final stage of the MLD method, whereinboth the first and second signals are spatially multiplexed andreceived, the signal demultiplexing method comprising: for each of aplurality of signal point candidates of the first signal, detecting aclosest neighboring signal point to thereby obtain a plurality ofclosest neighboring signal points, wherein each of the signal pointcandidates of the first signal is determined by one stage before thefinal stage, and each of the closest neighboring signal points is apoint that is on a constellation of points in a signal space of thesecond signal and that has a smallest distance from a signal pointcalculated based on each of the signal point candidates of the firstsignal, respectively; calculating a distance from each ofunitary-converted received signal points, to each of the plurality ofsignal point candidates of the first signal and to each of the pluralityof closest neighboring signal points; and determining a likelihood ofeach bit included in the first signal by identifying a correspondingsmallest value among the calculated distances.
 2. The signaldemultiplexing method of claim 1, wherein signal points are mapped onthe signal space by Gray coded mapping.
 3. A signal demultiplexingmethod for determining a likelihood of each bit included in first andsecond signals that are spatially multiplexed and received based on amaximum likelihood detection (MLD) method using QR decomposition, thefirst signal excluding the second signal to be calculated only in afinal stage of the MLD method, the signal demultiplexing methodcomprising: for each of a plurality of signal point candidates of thefirst signal, detecting a closest neighboring signal point to therebyobtain a plurality of closest neighboring signal points, wherein each ofthe signal point candidates of the first signal is determined by onestage before the final stage, and each of the closest neighboring signalpoints is a point that is on a constellation of points in a signal spaceof the second signal and that has a smallest distance from a signalpoint calculated based on each of the signal point candidates of thefirst signal, respectively; for each of the plurality of closestneighboring signal points, identifying a plurality of bit-inversedpoints that are each closest to the closest neighboring signal pointwithin a corresponding group of bit-inversed points, wherein pluralgroups of bit-inversed points respectively include signal points on theconstellation of points that have one of plural bits in the closestneighboring signal inversed; calculating a first distance from each ofunitary-converted received signal points, to each of the plurality ofsignal point candidates of the first signal and to each of the pluralityof neighboring signal points, to thereby obtain a plurality of firstdistances; calculating a second distance from each of theunitary-converted received signal points to each of the plurality ofbit-inversed points that are closest to each of the closest neighboringsignal points, to thereby obtain a plurality of second distances;determining a likelihood of each bit included in the first signal byidentifying a corresponding smallest value among the calculatedplurality of first distances alone; and determining a likelihood of eachbit included in the second signal by identifying a correspondingsmallest value among both the calculated plurality of first distancesand the calculated plurality of second distances.
 4. The signaldemultiplexing method of claim 3, wherein signal points are mapped onthe signal space by Gray coded mapping.
 5. A signal demultiplexingapparatus for determining a likelihood of each bit included in a firstsignal based on a maximum likelihood detection (MLD) method using QRdecomposition, the first signal excluding a second signal to becalculated only in a final stage of the MLD method, wherein both thefirst and second signals are spatially multiplexed and received, thesignal demultiplexing apparatus comprising: a detector detecting, foreach of a plurality of signal point candidates of the first signal, aclosest neighboring signal point to thereby detect a plurality ofclosest neighboring signal points, wherein each of the signal pointcandidates of the first signal is determined by one stage before thefinal stage, and each of the closest neighboring signal points is apoint that is on a constellation of points in a signal space of thesecond signal and that has a smallest distance from a signal pointcalculated based on each of the signal point candidates of the firstsignal, respectively; a calculator calculating a distance from each ofunitary-converted received signal points, to each of the plurality ofsignal point candidates of the first signal and to each of the pluralityof closet neighboring signal points; and a determinator determining alikelihood of each bit included in the first signal by identifying acorresponding smallest value among the calculated distances.
 6. Thesignal demultiplexing apparatus of claim 5, wherein signal points aremapped on the signal space by Gray coded mapping.
 7. A signaldemultiplexing apparatus for determining a likelihood of each bitincluded in first and second signals that are spatially multiplexed andreceived based on a maximum likelihood detection (MLD) method using QRdecomposition, the first signal excluding the second signal to becalculated only in a final stage of the MLD method, the signaldemultiplexing apparatus comprising: a detector detecting, for each of aplurality of signal point candidates of the first signal, a closestneighboring signal point to thereby obtain a plurality of closesneighboring signal points, wherein each of the signal point candidatesof the first signal is determined by one stage before the final stage,and each of the closest neighboring signal points is on a constellationof points in a signal space of the second signal and that has a smallestdistance from a signal point calculated based on each of the signalpoint candidates of the first signal, respectively; a selectoridentifying, for each of the plurality of closest neighboring signalpoints, a plurality of bit-inversed points that are each closest to theclosest neighboring signal point within a corresponding group ofbit-inversed points, wherein plural groups of bit-inversed pointsrespectively include signal points on the constellation of points thathave one of plural bits in the closest neighboring signal inversed; acalculator calculating a first distance from each of unitary-convertedreceived signal points, to each of the plurality of signal pointcandidates of the first signal and to each of the plurality ofneighboring signal points, to thereby obtain a plurality of firstdistances, and calculating a second distance from each of theunitary-converted received signal points to each of the plurality ofbit-inversed points that are closest to each of the closest neighboringsignal points, to thereby obtain a plurality of second distances; and adeterminator determining a likelihood of each bit included in the firstsignal by identifying a corresponding smallest value among thecalculated plurality of first distances alone, and determining alikelihood of each bit included in the second signal by identifying acorresponding smallest value among both the calculated plurality offirst distances and the calculated plurality of second distances.
 8. Thesignal demultiplexing apparatus of claim 7, wherein signal points aremapped on the signal space by Gray coded mapping.